Languages to diagonalize against advice classes
نویسندگان
چکیده
منابع مشابه
Classes of Languages Proof Against Regular Pumping
— The main purpose of this note is to collect a number ofscattered properties, examples and unanswered questions concerning classes of languages which are proof against varions farms of pumping of the words in the language. These forms of pumping lead to different infinité hiérarchies. Requiring that it must be possible to select from a prefix the substring to be repeated independently of the s...
متن کاملModulo Classes and Advice
We prove an upper bound on computing advice for a language A in the class of languages acceptable in deterministic polynomial time with logarithmic advice, A 2 P=log), relative to A itself. We then provide conditions under which advice for a language A 2 P=log can be computed in PF(A), and conditions for the existence of a set A in P=log without advice in PF(A). We show that paddable languages ...
متن کاملLogarithmic Advice Classes
Karp and Lipton [11] introduced the notion of non-uniform complexity classes where a certain amount of additional information, the advice, is given for free. The advice only depends on the length of the input. Karp and Lipton initiated the study of classes with either logarithmic or polynomial advice; however later researchers [24, 19, 2, 14] concentrated on the study of classes of the form C/p...
متن کامل“Ramadan challenges: Fasting against medical advice
AbstractAim: Fasting against medical advice (FAMA) is a major challenge for many physicians who treat patients with diabetes during the month of Ramadan. The significance of this phenomenon has not been evaluated in Muslim populations. The goal of this study was to assess the rate and consequences of FAMA in our high-risk patients.Methods: This is a retrospective case-control study. Patients we...
متن کاملAdvice Classes of Parameterized Tractability
Many natural computational problems have input consisting of two or more parts, one of which may be considered a parameter. For example, there are many problems for which the input consists of a graph and a positive integer. A number of results are presented concerning parameterized problems that can be solved (uniformly with respect to the parameter) in complexity classes below P , given a sin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2006
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-005-0202-1